package com.leetcode.June;

import javax.swing.tree.TreeNode;

/**
 * @Description: 对称二叉树
 * @Author: Mr.Fxy
 * @CreateTime: 2024-07-24 09:38
 */
public class symTree {
//    public boolean isSymmetric(TreeNode root) {
//        return isSameTree(root.left,root.right);
//    }
//    private boolean isSameTree(TreeNode p, TreeNode q) {
//        if (p == null || q == null)
//            return p == q;
//        return p.val == q.val && isSameTree(p.left, q.right) && isSameTree(p.right, q.left);
//    }}
}
